Bergman Complexes, Coxeter Arrangements, and Graph Associahedra
نویسنده
چکیده
Tropical varieties play an important role in algebraic geometry. The Bergman complex B(M) and the positive Bergman complex B+(M) of an oriented matroid M generalize to matroids the notions of the tropical variety and positive tropical variety associated to a linear ideal. Our main result is that if A is a Coxeter arrangement of type Φ with corresponding oriented matroid MΦ, then B (MΦ) is dual to the graph associahedron of type Φ, and B(MΦ) equals the nested set complex of A. In addition, we prove that for any orientable matroid M , one can find |μ(M)| different reorientations of M such that the corresponding positive Bergman complexes cover B(M), where μ(M) denotes the Möbius function of the lattice of flats of M .
منابع مشابه
m at h . C O ] 1 4 A ug 2 00 5 BERGMAN COMPLEXES , COXETER ARRANGEMENTS , AND GRAPH ASSOCIAHEDRA
Tropical varieties play an important role in algebraic geometry. The Bergman complex B(M) and the positive Bergman complex B+(M) of an oriented matroid M generalize to matroids the notions of the tropical variety and positive tropical variety associated to a linear ideal. Our main result is that if A is a Coxeter arrangement of type Φ with corresponding oriented matroid MΦ, then B (MΦ) is dual ...
متن کاملBrick Polytopes of Spherical Subword Complexes: a New Approach to Generalized Associahedra
We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspec...
متن کاملBrick Polytopes of Spherical Subword Complexes and Generalized Associahedra
We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized associahedra, thus opening new perspec...
متن کاملCoxeter Complexes and Graph-associahedra
Given a graph Γ, we construct a simple, convex polytope, dubbed graphassociahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The ...
متن کاملGeneralized Cluster Complexes and Coxeter Combinatorics
In the first part of this paper (Sections 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12), we introduce and study a simplicial complex ∆(Φ) associated to a finite root system Φ and a nonnegative integer parameter m. For m = 1, our construction specializes to the (simplicial) generalized associahedra ∆(Φ) introduced in [13] and identified in [14] as the underlying complexes for the cluster algebras of f...
متن کامل